Abstract dependency trees
ثبت نشده
چکیده
dependency trees 2 dependency trees that describe at least one possible sentence. An abstract dependency tree can consist of four node types: • Category (interior) nodes. • Lexical (leaf) nodes.
منابع مشابه
Constituency and Dependency Relationship from a Tree Adjoining Grammar and Abstract Categorial Grammars Perspective
This paper gives an Abstract Categorial Grammar (ACG) account of (Kallmeyer and Kuhlmann, 2012)’s process of transformation of the derivation trees of Tree Adjoining Grammar (TAG) into dependency trees. We make explicit how the requirement of keeping a direct interpretation of dependency trees into strings results into lexical ambiguity. Since the ACG framework has already been used to provide ...
متن کاملGRAALAN – Grammar Abstract Language Basics
This paper gives an outline about most important features of GRAALAN (Grammar Abstract Language) used for linguistic knowledge description. GRAALAN is an implementation of theoretical concepts of GDGF (Generative Dependency Grammars with Features) and AVT (Attribute Value Trees). GDGF is based on dependency trees (DT) and a generative process. GDG eliminates some issues of Dependency Grammars D...
متن کاملTopological Dependency Trees: A Constraint-Based Account of Linear Precedence
We describe a new framework for dependency grammar, with a modular decomposition of immediate dependency and linear precedence. Our approach distinguishes two orthogonal yet mutually constraining structures: a syntactic dependency tree and a topological dependency tree. The syntax tree is nonprojective and even non-ordered, while the topological tree is projective and partially ordered.
متن کاملLexical choice in Abstract Dependency Trees
In this work lexical choice in generation for Machine Translation is explored using lexical semantics. We address this problem by replacing lemmas with synonyms in the abstract representations that are used as input for generation, given a WordNet synset. In order to find the correct lemma for each node we propose to map dependency trees to Hidden Markov Trees that describe the probability of a...
متن کاملA Declarative Formalism for Constituent-to-Dependency Conversion
In this paper, we present a declarative formalism for writing rule sets to convert constituent trees into dependency graphs. The formalism is designed to be independent of the annotation scheme and provides a highly task-related syntax, abstracting away from the underlying graph data structures. We have implemented the formalism in our search tool and used a preliminary version to create a rule...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014